package easy

func FindChampion(grid [][]int) int {
	n := len(grid)
	max := 0
	prev := 0
	for i := 0; i < n; i++ {
		temp := grid[i]
		sum := 0
		for _, val := range temp {
			sum += val
		}
		if sum > max {
			max = sum
			prev = i
		}
	}
	return prev
}
